Some improvements on the particle beam generator

Some observations on the Bit-Search Generator

In this short note an alternative definition of the Bit-Search Generator (BSG) is provided. This leads to a discussion of both the security of the BSG and ways in which it might be modified to either improve its rate or increase its security.

On Some Properties of the Shrinking Generator

We obtain several results about the output rate and distribution of zeros and ones of the shrinking generator associated with two linear recurring sequences. These results are based on various bounds on the number of zeros of linear recurring sequences. Non-linear recurring sequences are considered as well.

On Some Improvements of the Jensen Inequality with Some Applications

Some Attacks on the Bit-Search Generator

The bit-search generator (BSG) was proposed in 2004 and can be seen as a variant of the shrinking and self-shrinking generators. It has the advantage that it works at rate 1/3 using only one LFSR and some selection logic. We present various attacks on the BSG based on the fact that the output sequence can be uniquely defined by the differential of the input sequence. By knowing only a small par...

Improvements in Beam-beam Tail Simulations†

Our beam-beam simulation code[1] has been improved and used to study lifetime phenomena under beam-beam interaction. One phenomenon observed is high order horizontal resonances (e. g., 8th to 16th), which are found to be exceptionally strong in the horizontal tail and have significant impact on lifetime. A first order perturbation calculation gives good agreement with the simulation on resonanc...